Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems
نویسندگان
چکیده
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Şerbănuţă and Roşu, is a sound structure-preserving transformation for weakly-left-linear deterministic conditional term rewriting systems. More precisely, we show that every weakly-leftlinear deterministic conditional term rewriting system can be converted to an equivalent weakly-leftlinear and ultra-weakly-left-linear deterministic conditional term rewriting system and prove that the SR transformation is sound for weakly-left-linear and ultra-weakly-left-linear deterministic conditional term rewriting systems. Here, soundness for a conditional term rewriting system means that reduction of the transformed unconditional term rewriting system creates no undesired reduction sequence for the conditional system.
منابع مشابه
On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Şerbănuţă and Roşu, is sound for weakly left-linear normal conditional term rewriting systems (CTRS). Here, soundness for a CTRS means that reduction of the transformed unconditional term rewriting system (TRS) creates no undesired reduction for the CTRS. We first show that every reduction...
متن کاملOn Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelingsú
The erb nu -Ro u transformation, a computationally equivalent transformation proposed by erb nu and Ro u, converts a left-linear confluent normal conditional term rewriting system (CTRS) into an unconditional term rewriting system (TRS) which is computationally equivalent to the original CTRS. This paper aims at investigating su cient conditions for soundness of the erb nu -Ro u transformation ...
متن کاملOn Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation∗
This paper improves the existing criterion for proving confluence of a normal conditional term rewriting system (CTRS) via the Şerbănuţă-Roşu transformation, a computationally equivalent transformation of CTRSs into unconditional term rewriting systems (TRS), showing that a weakly left-linear normal CTRS is confluent if the transformed TRS is confluent. Then, we discuss usefulness of the optimi...
متن کاملSoundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
Unravelings are transformations from conditional term rewriting systems(CTRSs) into unconditional term rewriting systems (TRSs) over extended signatures.They are complete, but in general, not sound w.r.t. reduction. Here, soundness w.r.t. reduction for a CTRS means that for every term over the original signature of the CTRS,if the corresponding unraveled TRS reduces the term to a te...
متن کاملDeterminization of conditional term rewriting systems
This paper discusses determinization of conditional term rewriting systems with oriented constructor rules. We present a rule-based transformation system, which transforms a non-deterministic one into a deterministic one, together with examples of the transformation. We prove that the transformation system is simulation sound and simulation complete. We also prove that the transformation system...
متن کامل